Elementary logic without referential quantification.
نویسندگان
چکیده
منابع مشابه
Referential logic of proofs
We introduce an extension of the propositional logic of single-conclusion proofs by the second order variables denoting the reference constructors of the type “the formula which is proved by x.” The resulting Logic of Proofs with References, FLPref, is shown to be decidable, and to enjoy soundness and completeness with respect to the intended provability semantics. We show that FLPref provides ...
متن کاملAlgebraic Logic : Referential Algebraic Semantics
Wójcicki has provided a characterization of selfextensional logics as those that can be endowed with a complete local referential semantics. His result was extended by Jansana and Palmigiano, who developed a duality between the category of reduced congruential atlases and that of reduced referential algebras over a fixed similarity type. This duality restricts to one between reduced atlas model...
متن کاملLinear Logic & Elementary Time
Think of elementary linear logic as an idealized functional programming language with a severe typing mechanism. Definition by recursion is, of course, forbidden, but some sort of iteration still is possible and the purpose of this paper is to show that enough computing power remains so that elementary recursive functions can be implemented. Actually, the whole paper can be considered an exerci...
متن کاملThe Referential Basis of Abduction and Logic
AI has often mistreated logic and abduction.A closer view at the historical roots of logic and at the system theoretic structure of logical modeling reveals that the foundations of logic lie in a science of argumentation rather than reasoning. The basis of such a science is a clarifcation of the term “argument” that also leads to a reduction of the semantics of natural language. In logic, the r...
متن کاملLinear logic and elementary time
A subsystem of linear logic, elementary linear logic, is defined and shown to represent exactly elementary recursive functions. Its choicest part consists in reducing the deductive power of the exponential, also known as the ‘‘bang,’’ which, in linear logic, is in charge of controlling duplication in the cut-elimination process. 2003 Elsevier Science (USA). All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1971
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093894365